Applicative Shortcut Fusion
نویسندگان
چکیده
In functional programming one usually writes programs as the composition of simpler functions. Consequently, the result of a function might be generated only to be consumed immediately by another function. This potential source of inefficiency can often be eliminated using a technique called shortcut fusion, which fuses both functions involved in a composition to yield a monolithic one. In this article we investigate how to apply shortcut fusion to applicative computations. Applicative functors provide a model of computational effects which generalise monads, but they favour an applicative programming style. To the best of our knowledge, this is the first time shortcut fusion is considered in an applicative setting.
منابع مشابه
Multiple Intermediate Structure Deforestation by Shortcut Fusion
Shortcut fusion is a well-known optimization technique for functional programs. Its aim is to transform multi-pass algorithms into single pass ones, achieving deforestation of the intermediate structures that multi-pass algorithms need to construct. Shortcut fusion has already been extended in several ways. It can be applied to monadic programs, maintaining the global effects, and also to obtai...
متن کاملA shortcut fusion approach to accumulations
In functional programming it is common to write programs as composition of other simpler functions. This makes it possible to take advantage of the well-known benefits of modular programming. However, in many cases, the resulting programs have efficiency problems caused by the generation of data structures that are solely used for communication between the intervening functions in the compositi...
متن کاملA Linguistic and Computational Morphosyntactic Analysis for the Applicative -i in Indonesian
We present a precise LFG-based analysis of the suffix –i in Indonesian, addressing the issues of applicative-causative polysemy of the suffix and its alternation with –kan. We also show how the analysis can be integrated into an implementation of an existing computational grammar. Our computational implementation of applicativisation and related phenomena is the first of its kind for Indonesian...
متن کاملShortcut Fusion of Monadic Programs
Functional programs often combine separate parts of the program using intermediate data structures for communicating results. Programs so defined are easier to understand and maintain, but suffer from inefficiency problems due to the generation of those data structures. In response to this problematic, some program transformation techniques have been studied with the aim to eliminate the interm...
متن کاملSemantics and Pragmatics of New Shortcut Fusion Rules
We study various shortcut fusion rules for languages like Haskell. Following a careful semantic account of a recently proposed rule for circular program transformation, we propose a new rule that trades circularity for higher-orderedness, and thus attains better semantic properties. This also leads us to revisit the original foldr/build-rule, as well as its dual, and to develop variants that do...
متن کامل